Feasibility-Guided Constraint-Handling Techniques for Engineering Optimization Problems

نویسندگان

چکیده

The particle swarm optimization (PSO) algorithm is an established nature-inspired population-based meta-heuristic that replicates the synchronizing movements of birds and fish. PSO essentially unconstrained requires constraint handling techniques (CHTs) to solve constrained problems (COPs). For this purpose, we integrate two CHTs, superiority feasibility (SF) violation constraint-handling (VCH), with a PSO. These CHTs distinguish feasible solutions from infeasible ones. Moreover, in SF, selection based on their degree violations, whereas VCH, number violations by solution more importance. Therefore, adapted for optimization, yielding variants, denoted SF-PSO VCH-PSO. Both VCH-PSO are evaluated respect five engineering problems: Himmelblau’s nonlinear welded beam design, spring pressure vessel three-bar truss design. simulation results show both algorithms consistent terms these problems, including different available versions. Comparison other existing tested shows proposed have lower computational cost function evaluations used. We also report our disagreement some unjust comparisons made researchers regarding variants.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feasibility Preserving Constraint-Handling Strategies for Real Parameter Evolutionary Optimization

Evolutionary Algorithms (EAs) are being routinely applied for a variety of optimization tasks, and real-parameter optimization in the presence of constraints is one such important area. During constrained optimization EAs often create solutions that fall outside the feasible region; hence a viable constrainthandling strategy is needed. This paper focuses on the class of constraint-handling stra...

متن کامل

A Comparison of Constraint Handling Techniques for Dynamic Constrained Optimization Problems

Dynamic constrained optimization problems (DCOPs) have gained researchers attention in recent years because a vast majority of real world problems change over time. There are studies about the effect of constrained handling techniques in static optimization problems. However, there lacks any substantial study in the behavior of the most popular constraint handling techniques when dealing with D...

متن کامل

A Novel Constraint Handling Strategy for Expensive Optimization Problems

1. Abstract Constraints are inherently present in any real world problem. In the context of multidisciplinary design optimization problems, such constraints arise out of physical laws, statutory requirements, user preferences etc. and are often computed using computationally expensive analysis e.g. FEM, CFD, CEM etc. While population based stochastic optimization algorithms are a preferred choi...

متن کامل

FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems

These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...

متن کامل

Efficient Handling of Complex Local Problems in Distributed Constraint Optimization

Many distributed constraint optimisation algorithms require each agent to have a single variable. For agents with multiple variables, a standard approach is to compile the local problem down to a new variable whose domain is the set of all local solutions. We present two modifications to this method, which (i) reduce problem size by removing interchangeable and dominated local solutions, and (i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers, materials & continua

سال: 2021

ISSN: ['1546-2218', '1546-2226']

DOI: https://doi.org/10.32604/cmc.2021.015294